Micron Document
`:top
In `F33f`_`[computer science`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Computer_science]`_`f, a `!synchronizer`! is an `F33f`_`[algorithm`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Algorithm]`_`f that can be used to run a `F33f`_`[synchronous`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Synchronization_(computer_science)]`_`f algorithm on top of an asynchronous processor network, so enabling the `F33f`_`[asynchronous system`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Asynchronous_system]`_`f to run as a synchronous network.

The concept was originally proposed in (Awerbuch, 1985) along with three synchronizer algorithms named `!alpha`!, `!beta`! and `!gamma`! which provided different tradeoffs in terms of time and message complexity. Essentially, they are a solution to the problem of asynchronous algorithms (which operate in a network with no global clock) being harder to design and often less efficient than the equivalent synchronous algorithms. By using a synchronizer, algorithm designers can deal with the simplified "ideal network" and then later mechanically produce a version that operates in more realistic asynchronous cases.

>>Contents

• `F0af`_`[Available synchronizer algorithms`#available-synchronizer-algorithms]`_`f
• `F0af`_`[References`#references]`_`f

-─

>>Available synchronizer algorithms

The three algorithms that Awerbuch provided in his original paper are as follows:

• `!Alpha synchronizer`!: This has low time complexity but high message complexity.
• `!Beta synchronizer`!: This has high time complexity but low message complexity.
• `!Gamma synchronizer`!: This provides a reasonable tradeoff between alpha and beta by providing fairly low time and message complexity.

Since the original paper, other synchronizer algorithms have been proposed in the literature.

>>References

• `:citerefbaruch-awerbuch1985`a`F33f`_`[Baruch Awerbuch`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Baruch_Awerbuch]`_`f (1985). "Complexity of Network Synchronization" (PDF).

`c`F0af`_`[↑ Back to top`#top]`_`f`a